https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 A Machine Learning Approach for Identification of Malignant Mesothelioma Etiological Factors in an Imbalanced Dataset https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:49626 Wed 24 May 2023 13:25:52 AEST ]]> Corporate Bankruptcy Prediction: An Approach Towards Better Corporate World https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:49911 Wed 14 Jun 2023 16:06:00 AEST ]]> A new construction for linkable secret handshake https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:38180 Tue 17 Aug 2021 15:56:41 AEST ]]> The strong connectivity of bubble-sort star graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:44260 n-dimensional bubble-sort star graph BSn has many good properties. We give some strong connectivity of BSn, too.]]> Tue 11 Oct 2022 12:49:55 AEDT ]]> NDN-RBE: An Accountable Privacy Aware Access Control Framework For NDN https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:55381 Thu 23 May 2024 14:29:50 AEST ]]> Server-aided signature verification for lightweight devices https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31621 hardware cost into consideration. The hardware implementation of SAV protocols could be still costly and expensive for lightweight devices. Currently, the most secure SAV protocols in the literature for pairing-based (𝔾1 × 𝔾2 → 𝔾T) signatures can securely delegate pairing computations to the server; however, verifiers are still required to perform group operations over two completely different groups 𝔾1 and 𝔾2, which heavily contribute to the cost of hardware implementation. In this work, we propose several collusion-resistant SAV protocols for pairing-based signatures to improve their applicability for lightweight devices. In our SAV protocols, verifiers are only required to perform group operations in 𝔾1. In comparison with existing SAV protocols, our protocols save the unnecessary hardware cost for implementing group operations in 𝔾T and therefore are more applicable to lightweight applications.]]> Sat 24 Mar 2018 08:45:08 AEDT ]]> Enforcing role-based access control for secure data storage in the cloud https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31626 Sat 24 Mar 2018 08:45:05 AEDT ]]> Rethinking software component security: software component level integrity and cross verification https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31628 Sat 24 Mar 2018 08:45:04 AEDT ]]> Trust enhanced security for tenant transactions in the cloud environment https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31658 Sat 24 Mar 2018 08:44:48 AEDT ]]> Dynamic state-based security architecture for detecting security attacks in virtual machines https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31659 Sat 24 Mar 2018 08:44:47 AEDT ]]> On the partition dimension of circulant graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31515 v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}. For an ordered k.-partition Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)). The k-partition Π is a resolving partition if the k-vectors r(v∣Π), v∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs [formula cannot be replicated]]]> Sat 24 Mar 2018 08:43:35 AEDT ]]> Parameterized complexity and biopolymer sequence comparison https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5488 Sat 24 Mar 2018 07:47:00 AEDT ]]> Average distance in interconnection networks via reduction theorems for vertex-weighted graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:29436 Sat 24 Mar 2018 07:39:19 AEDT ]]> Minimum linear arrangement of incomplete hypercubes https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:27495 Sat 24 Mar 2018 07:25:39 AEDT ]]> The Computer Journal special issue on parameterized complexity: foreword by the guest editors (editorial) https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:4731 Sat 24 Mar 2018 07:21:10 AEDT ]]> A lower bound for dilation of an embedding https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24372 Sat 24 Mar 2018 07:16:18 AEDT ]]> A Fuzzy Inference-Based Decision Support System for Disease Diagnosis https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:50390 Mon 24 Jul 2023 14:40:16 AEST ]]> Byte2vec: malware representation and feature selection for android https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:44462 Fri 14 Oct 2022 08:29:30 AEDT ]]>